Subadditive measures and small systems
نویسندگان
چکیده
منابع مشابه
On Finitely Subadditive Outer Measures and Modularity Properties
Let ν be a finite, finitely subadditive outer measure on P(X). Define ρ(E)= ν(X)− ν(E′) for E ⊂ X. The measurable sets Sν and Sρ and the set S = {E ⊂ X/ν(E) = ρ(E)} are investigated in general, and in the presence of regularity or modularity assumptions on ν . This is also done for ν0(E) = inf{ν(M)/E ⊂ M ∈ Sν}. General properties of ν are derived when ν is weakly submodular. Applications and nu...
متن کاملOn Constructing Finite, Finitely Subadditive Outer Measures, and Submodularity
Given a nonempty abstract set X, and a covering class C, and a finite, finitely subadditive outer measure ν, we construct an outer measure ν and investigate conditions for ν to be submodular. We then consider several other set functions associated with ν and obtain conditions for equality of these functions on the lattice generated by C. Lastly, we describe a construction of a finite, finitely ...
متن کاملKingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem
A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.
متن کاملSubadditive Ergodic Theorems
Above is the famous Fekete’s lemma which demonstrates that the ratio of subadditive sequence (an) to n tends to a limit as n approaches infinity. This lemma is quite crucial in the field of subadditive ergodic theorems because it gives mathematicians some general ideas and guidelines in the non-random setting and leads to analogous discovery in the random setting. Kingman’s Subadditive Ergodic ...
متن کاملSolving Boolean Equation Systems using Small Progress Measures
We investigate a parity game interpretation of boolean equation systems. Given this interpretation, we present a version of the algorithm for solving parity games based on small progress measures [3]. The algorithm is applied directly on the boolean equation system (BES), eliminating the intermediate transformation step of BES to parity game. The resulting algorithm runs in O(ad(E)ΣX∈X |rhs(X)|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1974
ISSN: 0528-2195
DOI: 10.21136/cpm.1974.117845